Subgraph Counting Identities and Ramsey Numbers
نویسندگان
چکیده
منابع مشابه
Zarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کاملzarankiewicz numbers and bipartite ramsey numbers
the zarankiewicz number z(b; s) is the maximum size of a subgraph of kb,b which does not contain ks,s as a subgraph. the two-color bipartite ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of kb,b with two colors contains a ks,s in the rst color or a kt,t in the second color.in this work, we design and exploit a computational method for bounding and computin...
متن کاملBipartite Ramsey numbers and Zarankiewicz numbers
The Zarankiewicz number z(s, m) is the maximum number of edges in a subgraph of K(s, s) that does not contain K(m, m) as a subgraph. The bipartite Ramsey number b(m, n) is the least positive integer b such that if the edges of K(b, b) are coloured with red and blue, then there always exists a blue K(m, m) or a red K(n, n). In this paper we calculate small exact values of z(s, 2) and determine b...
متن کاملDifference Ramsey Numbers and Issai Numbers
We present a recursive algorithm for finding good lower bounds for the classical Ramsey numbers. Using notions from this algorithm we then give some results for a generalization of the Generalized Schur numbers, which we call Issai numbers.
متن کاملStar-Avoiding Ramsey Numbers
The graph Ramsey number R(G,H) is the smallest integer n such that every 2-coloring of the edges of Kn contains either a red copy of G or a blue copy of H . We find the largest star that can be removed from Kn such that the underlying graph is still forced to have a red G or a blue H . Thus, we introduce the star-avoiding Ramsey number r∗(G,H) as the smallest integer k such that every 2-colorin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1997
ISSN: 0095-8956
DOI: 10.1006/jctb.1996.1741